Spectrum of Markov Generators on Sparse Random Graphs
نویسندگان
چکیده
منابع مشابه
Spectrum of Markov generators on sparse random graphs
We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random n× n matrix L defined by Ljk = Xjk if k 6= j and Ljj = − ∑ k 6=j Ljk , where (Xjk)j 6=k are i.i.d. random weights. Under mild assumptions on the law of the weights, we establish convergence as n → ∞ of the empirical spectral distri...
متن کاملOn the Rigidity of Sparse Random Graphs
A graph with a trivial automorphism group is said to be rigid. Wright proved [11] that for logn n + ω( 1 n) ≤ p ≤ 1 2 a random graph G ∈ G(n, p) is rigid whp. It is not hard to see that this lower bound is sharp and for p < (1− ) logn n with positive probability aut(G) is nontrivial. We show that in the sparser case ω( 1 n) ≤ p ≤ logn n + ω( 1 n), it holds whp that G’s 2-core is rigid. We concl...
متن کاملOn limits of sparse random graphs
We present a notion of convergence for sequences of finite graphs {Gn} that can be seen as a generalization of the Benjamini-Schramm convergence notion for bounded degree graphs, regarding the distribution of r-neighbourhoods of the vertices, and the left-convergence notion for dense graphs, regarding, given any finite graph F , the limit of the probabilities that a random map from V (F ) to V ...
متن کاملBisecting sparse random graphs
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of ‘‘cross edges’’ between the parts. We are interested in sparse random graphs Ž . G with edge probability c n. We show that, if c ln 4, then the bisection width is n n, c n with high probability; while if c ln 4, the...
متن کاملSparse Quasi-Random Graphs
Quasi-random graph properties form a large equivalence class of graph properties which are all shared by random graphs. In recent years, various aspects of these properties have been treated by a number of authors (e.g., see [5]-[14], [16], [23]-[27]). Almost all of these results deal with dense graphs, that is, graphs on n vertices having cn edges for some c > 0 as n → ∞. In this paper, we ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2013
ISSN: 0010-3640
DOI: 10.1002/cpa.21496